package org.hot100_1;

import org.algorithm.List.ListNode;

public class leetcode27 {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        ListNode dummy = new ListNode(-1);

        ListNode node = dummy;

        while (list1!=null && list2!=null){
            if (list1.val>list2.val){
                node.next=list2;
                list2=list2.next;
            }else {
                node.next=list1;
                list1= list1.next;
            }

            node=node.next;
        }
        if (list1==null){
            node.next=list2;
        }else{
            node.next=list1;
        }

        return dummy.next;
    }
}
